Termination w.r.t. Q of the following Term Rewriting System could be proven:

Q restricted rewrite system:
The TRS R consists of the following rules:

f(f(a, x), a) → f(f(a, f(a, f(a, a))), x)

Q is empty.


↳ QTRS
  ↳ Overlay + Local Confluence

Q restricted rewrite system:
The TRS R consists of the following rules:

f(f(a, x), a) → f(f(a, f(a, f(a, a))), x)

Q is empty.

The TRS is overlay and locally confluent. By [19] we can switch to innermost.

↳ QTRS
  ↳ Overlay + Local Confluence
    ↳ QTRS
      ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

f(f(a, x), a) → f(f(a, f(a, f(a, a))), x)

The set Q consists of the following terms:

f(f(a, x0), a)


Using Dependency Pairs [1,15] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

F(f(a, x), a) → F(a, a)
F(f(a, x), a) → F(f(a, f(a, f(a, a))), x)
F(f(a, x), a) → F(a, f(a, a))
F(f(a, x), a) → F(a, f(a, f(a, a)))

The TRS R consists of the following rules:

f(f(a, x), a) → f(f(a, f(a, f(a, a))), x)

The set Q consists of the following terms:

f(f(a, x0), a)

We have to consider all minimal (P,Q,R)-chains.

↳ QTRS
  ↳ Overlay + Local Confluence
    ↳ QTRS
      ↳ DependencyPairsProof
        ↳ QDP
          ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

F(f(a, x), a) → F(a, a)
F(f(a, x), a) → F(f(a, f(a, f(a, a))), x)
F(f(a, x), a) → F(a, f(a, a))
F(f(a, x), a) → F(a, f(a, f(a, a)))

The TRS R consists of the following rules:

f(f(a, x), a) → f(f(a, f(a, f(a, a))), x)

The set Q consists of the following terms:

f(f(a, x0), a)

We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 3 less nodes.

↳ QTRS
  ↳ Overlay + Local Confluence
    ↳ QTRS
      ↳ DependencyPairsProof
        ↳ QDP
          ↳ DependencyGraphProof
            ↳ QDP
              ↳ UsableRulesProof

Q DP problem:
The TRS P consists of the following rules:

F(f(a, x), a) → F(f(a, f(a, f(a, a))), x)

The TRS R consists of the following rules:

f(f(a, x), a) → f(f(a, f(a, f(a, a))), x)

The set Q consists of the following terms:

f(f(a, x0), a)

We have to consider all minimal (P,Q,R)-chains.
As all Q-normal forms are R-normal forms we are in the innermost case. Hence, by the usable rules processor [15] we can delete all non-usable rules [17] from R.

↳ QTRS
  ↳ Overlay + Local Confluence
    ↳ QTRS
      ↳ DependencyPairsProof
        ↳ QDP
          ↳ DependencyGraphProof
            ↳ QDP
              ↳ UsableRulesProof
                ↳ QDP
                  ↳ Instantiation

Q DP problem:
The TRS P consists of the following rules:

F(f(a, x), a) → F(f(a, f(a, f(a, a))), x)

R is empty.
The set Q consists of the following terms:

f(f(a, x0), a)

We have to consider all minimal (P,Q,R)-chains.
By instantiating [15] the rule F(f(a, x), a) → F(f(a, f(a, f(a, a))), x) we obtained the following new rules:

F(f(a, f(a, f(a, a))), a) → F(f(a, f(a, f(a, a))), f(a, f(a, a)))



↳ QTRS
  ↳ Overlay + Local Confluence
    ↳ QTRS
      ↳ DependencyPairsProof
        ↳ QDP
          ↳ DependencyGraphProof
            ↳ QDP
              ↳ UsableRulesProof
                ↳ QDP
                  ↳ Instantiation
                    ↳ QDP
                      ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

F(f(a, f(a, f(a, a))), a) → F(f(a, f(a, f(a, a))), f(a, f(a, a)))

R is empty.
The set Q consists of the following terms:

f(f(a, x0), a)

We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 0 SCCs with 1 less node.